Arc Consistency and Quasigroup Completion
نویسندگان
چکیده
Quasigroup completion is a recently proposed benchmark constraint satisfaction problem that combines the features of randomly generated instances and highly structured problems. A quasigroup completion problem can be represented as a CSP with n 2 variables, each with a domain of size n. The constraints can be represented either by 2n all diierent n-ary constraints or by binary pairwise constraints, giving a constraint graph with 2n cliques of size n. We present a comparison between the two representations and show that the nary representation reduces the cost of solving quasigroup completion problems drastically.
منابع مشابه
The Difference All-Difference Makes
We perform a comprehensive theoretical and experimental analysis of the use of all-different constraints. We prove that generalized arc-consistency on such constraints lies between neighborhood inverse consistency and, under a simple restriction, path inverse consistency on the binary representation of the problem. By generalizing the arguments of Kondrak and van Beek, we prove that a search al...
متن کاملThe Di erence All - Di erence Makes
We perform a comprehensive theoretical and experimental analysis of the use of all-diierent constraints. We prove that generalized arc-consistency on such constraints lies between neighborhood inverse consistency and, under a simple restriction, path inverse consistency on the binary representation of the problem. By generalizing the arguments of Kondrak and van Beek, we prove that a search alg...
متن کاملOn Generators of Random Quasigroup Problems
Random problems are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representative of structured random problems that are closer to real-life problems. In this paper, we study generators for Quasigroup Completion Problem (QCP) and Quasigroups with Holes (QWH). We propose an improvement of the generator for QCP that produces a lar...
متن کاملChanneling Constraints and Value Ordering in the QuasiGroup Completion Problem
The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and a focus of much recent interest in the area of constraint programming. It has numerous practical applications [Gomes et al., 2002]; it has been put forward as a benchmark which can bridge the gap between purely random instances and highly structured problems [Gomes et al., 2002]; and its st...
متن کاملRedundant Modeling for the QuasiGroup Completion Problem
The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint programming. [5] reports that QCPs of order 40 could not be solved by pure constraint programming approaches, but could sometimes be solved by hybrid approaches combining constraint programming with mixed integer programming techni...
متن کامل